New Hybrid Algorithm Based on BicriterionAnt for Solving Multiobjective Green Vehicle Routing Problem

The main objective of this paper is to propose a new hybrid algorithm for solving the Bi green vehicle routing problem (BGVRP) from BicriterionAnt metaheuristic. methodology used subdivided as follows: first, we introduce data GVRP or instances literature. Second, use first cluster route second technique using k-means algorithm, then apply BicriterionAntAPE (BicriterionAnt Adjacent Pairwise Exchange) each obtained. And finally, make comparative analysis results obtained by case study well literature with some existing metaheuristics NSGA, SPEA, in order see performance algorithm. show that routes which minimize total distance traveled vehicles are different those CO2 pollution, can be understood fact objectives conflicting. In study, also find optimal reduces product almost 7.2% compared worst route.